High order compact solution of the one‐space‐dimensional linear hyperbolic equation

In this article, we introduce a high‐order accurate method for solving one‐space dimensional linear hyperbolic equation. We apply a compact finite difference approximation of fourth order for discretizing spatial derivative of linear hyperbolic equation and collocation method for the time component. The main property of this method additional to its high‐order accuracy due to the fourth order discretization of spatial derivative, is its unconditionally stability. In this technique the solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. Numerical results show that the compact finite difference approximation of fourth order and collocation method produce a very efficient method for solving the one‐space‐dimensional linear hyperbolic equation. We compare the numerical results of this paper with numerical results of (Mohanty, 3 .© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Asymptotic relations between the Hahn-type polynomials and Meixner–Pollaczek, Jacobi, Meixner and Krawtchouk polynomials

It has been shown in Ferreira et al. [Asymptotic relations in the Askey scheme for hypergeometric orthogonal polynomials, Adv. in Appl. Math. 31(1) (2003) 61–85], López and Temme [Approximations of orthogonal polynomials in terms of Hermite polynomials, Methods Appl. Anal. 6 (1999) 131–146; The Askey scheme for hypergeometric orthogonal polynomials viewed from asymptotic analysis, J. Comput. Appl. Math. 133 (2001) 623–633] that the three lower levels of the Askey table of hypergeometric orthogonal polynomials are connected by means of asymptotic relations. In Ferreira et al. [Limit relations between the Hahn polynomials and the Hermite, Laguerre and Charlier polynomials, submitted for publication] we have established new asymptotic connections between the fourth level and the two lower levels. In this paper, we continue with that program and obtain asymptotic expansions between the fourth level and the third level: we derive 16 asymptotic expansions of the Hahn, dual Hahn, continuous Hahn and continuous dual Hahn polynomials in terms of Meixner–Pollaczek, Jacobi, Meixner and Krawtchouk polynomials. From these expansions, we also derive three new limits between those polynomials. Some numerical experiments show the accuracy of the approximations and, in particular, the accuracy in the approximation of the zeros of those polynomials.     

Strong Convergence of an Implicit Iteration Process for a Finite Family of Asymptotically Ф-pseudocontractive Mappings

Strong convergence theorems for approximation of common fixed points of asymptotically Ф-quasi-pseudocontractive mappings and asymptotically C-strictly- pseudocontractive mappings are proved in real Banach spaces by using a new composite implicit iteration scheme with errors. The results presented in this paper extend and improve the main results of Sun, Gu and Osilike published on J. Math. Anal. Appl.     

Adaptive scheme for time-varying anticipating synchronization of certain or uncertain chaotic dynamical systems

In this paper, a new type of anticipating synchronization, called time-varying anticipating synchronization, is defined firstly. Then novel adaptive schemes for time-varying anticipating synchronization of certain or uncertain chaotic dynamical systems are designed based on the Lyapunov function and invariance principle. The update gain of coupling strength can be automatically adapted to a suitable strength depending on the initial values and can be properly chosen to adjust the speed of achieving synchronization, so these schemes are analytical and simple to implement in practice. A classical chaotic dynamical system is used to demonstrate the effectiveness of the proposed adaptive schemes with or without parameter uncertainties.     

An efficient numerical algorithm for simulating a two-dimensional glow discharge

A numerical algorithm of the second approximation order with respect to the space variables for simulating a two-dimensional elevated pressure glow discharge in the framework of the drift-diffusion approximation is presented. A specific feature of this algorithm is the use of the Laplace resolving operator for the solution of the system of grid equations. This makes it possible to ensure the convergence of the solution in strong grid norms. Mathematical aspects of the statement of the differential-difference and finite difference problems (solvability, nonnegativity, approximation, stability, and convergence) are discussed, and bounds on the norms of the corresponding differential and difference operators that are required for constructing an optimal iterative process are obtained.     

抛物型方程非齐次边值问题的推广型LOD有限差分及有限元格式

1引言本文考虑区域Ω=[0,1]~d(d=2,3)上的非齐次抛物型方程第一边值问题(?)-C_1△u C_2u=f(x,t),x∈Ω,t∈(0,T],(1．1) u(x,0)=u_0(x),x∈Ω,(1．2) u(x,t)=(?)(x,t),x∈(?)Ω,t∈(0,T],(1．3)其中C_1,C_2为常数且C_1＞0,C_2≥0．对于以上问题,可以使用有限差分方法及有限元方法进行离散,并采用交替方向方法求解．交替方向方法能够将高维问题转化为一系列的一维问题进行计算,具有计算量少,计算稳定且易于并行实现等优点,在大规模科学计算中起着非常重要的作用,一直是计算数     

A stable gradient reconstruction for the MUSCL schemes applied to systems of conservation laws

The numerical simulations of compressible flows need more and more accuracy. Several approaches can be used to increase the order of the scheme. One of the most popular has been introduced by [11]: the so-called MUSCL scheme. In the present work, we focus our attention on the robustness of this method. We propose a relevant CFL restriction and a new gradient reconstruction strategy to enforce stability of the method. The novelty stays in the fact that non conservation argument is involved in the gradient reconstruction. Numerical results are performed using this new variant of the MUSCL scheme.     

工件带安装时间的单机排序问题的列生成算法

在求解大规模NP-困难的最优化问题方法中,列生成技术越来越受到重视.本文研究工件带有与加工次序有关的安装时间的单机排序问题,首先构造它的时间标号模型,结合D-W分解技术和分支定界方法,给出它的列生成算法.其中时间标号模型的线性松弛为原问题提供了很好的下界,然后提出一个近似算法.通过实验数据表明,我们的算法对中等规模的排序问题1|t_(ij),r_j|∑w_jC_j是有效的.     

Weak order stochastic Runge–Kutta methods for commutative stochastic differential equations

A new explicit stochastic Runge–Kutta scheme of weak order 2 is proposed under a commutativity condition, which is derivative-free and which attains order 4 for ordinary differential equations. The weak order conditions are derived by utilizing multi-colored rooted tree analysis and a solution is found in a transparent way. The scheme is compared with other derivative-free and weak second order schemes in numerical experiments.     

A formula for the error of finite sinc-interpolation over a finite interval

Sinc-interpolation is a very efficient infinitely differentiable approximation scheme from equidistant data on the infinite line. It, however, requires that the interpolated function decreases rapidly or is periodic. We give an error formula for the case where neither of these conditions is satisfied. In celebration of Leonhard Euler’s 300th birthday. Work partly supported by the Swiss National Science Foundation under grant Nr 200020-103662/1.